1 2 3 4
نویسندگان
چکیده
and Material
منابع مشابه
Supplement to Internally 4-connected projective-planar graphs
A5 = {{1, 2}, {1, 3}, {1, 4}, {1, 5}, {2, 3}, {2, 4}, {2, 5}, {3, 4}, {3, 5}, {4, 5}, {6, 7}, {6, 8}, {6, 9}, {6, 10}, {7, 8}, {7, 9}, {7, 10}, {8, 9}, {8, 10}, {9, 10}} C11 = {{1, 2}, {1, 3}, {1, 4}, {1, 5}, {2, 3}, {2, 4}, {2, 5}, {3, 4}, {3, 5}, {4, 5}, {6, 9}, {6, 10}, {6, 11}, {7, 9}, {7, 10}, {7, 11}, {8, 9}, {8, 10}, {8, 11}} E42 = {{1, 4}, {1, 5}, {1, 6}, {2, 4}, {2, 5}, {2, 6}, {3, 4},...
متن کاملAdditional file 5.xlsx
position -4 C50 C49 C48 C47 C46 C45 C44 C43 C42 C41 C40 C39 C38 C37 C36 C35 C34 C33 C32 C31 C30 C29 C28 C27 C26 C25 C24 C23 C22 C21 C20 C19 C18 C17 C16 C15 C14 C13 C12 C11 C10 C9 C8 C7 C6 C5 C4 C3 C2 C1 C0 C-index SD P-value mark A 5 7 9 1 8 4 6 2 1 4 8 7 6 9 3 4 3 7 15 10 6 6 9 3 2 5 3 6 8 9 6 3 5 7 7 10 4 7 7 8 5 5 8 2 2 3 1 2 5 5 9 0.618 0.317 8.27E-03 n.s. A C 3 1 2 0 2 3 3 1 1 2 1 7 4 9 1 ...
متن کاملEnhanced Symplectic Synchronization between Two Different Complex Chaotic Systems with Uncertain Parameters
and Applied Analysis 3 Equation (8) can be expressed as ̇ e 1 = − 2y 1 x 1 [a (x 2 − x 1 ) + x 4 ] − (1 + x 2 1 ) × [a 1 (y 2 − y 1 ) + y 4 ] − u 1 + 3x 2 4 (rx 4 + x 2 x 3 ) , ̇ e 2 = − 2y 2 x 2 (dx 1 + cx 2 − x 1 x 3 ) − (1 + x 2 2 ) × (b 1 y 1 − y 2 − y 1 y 3 ) − u 2 + 3x 2 1 [a (x 2 − x 1 ) + x 4 ] , ̇ e 3 = − 2y 3 x 3 (−bx 3 + x 1 x 2 ) − (1 + x 2 3 ) × (−c 1 y 3 + y 1 y 2 ) − u 3 + 3x 2 2 (d...
متن کاملWork supported in part by US Department of Energy contract DE-AC02-76SF00515
! " " # $$ $ " ! $$ ! # ! " ## !$ % & ' ( ) * + #, + $ * ./ / , 0 1 . 2 ) " ( '. & 3 # ( + , , % ! ( #/ " ## " + " ## +, 4 $ $ 2 4 5/. 2 % 5, $ ) 2 1 , 0 / . 2 0 . 2 $ 2 + / , 2 & ,. 2 " $ / % + .)/ .6 " " $. " # % # . ( #* 3 / 7 1 ! " # ! 8 , * * ! " ( ! % + 2 $ ./ % 4 ,* " ( , + ) ! 3 .* " # 5 , $. , ** 1 3 # * ( , ! % % $$ , % ( #$ 1 !* !. $. $ 7 # 4 . # 4 " % ) 2 " $$ " ' " % . $ 9 $ * 3 7 ...
متن کاملFaster Generation of Shorthand Universal Cycles for Permutations
A universal cycle for the k-permutations of 〈n〉 = {1, 2, ..., n} is a circular string of length (n)k that contains each k-permutation exactly once as a substring. Jackson (Discrete Mathematics, 149 (1996) 123–129) proved their existence for all k ≤ n − 1. Knuth (The Art of Computer Programming, Volume 4, Fascicle 2, Addison-Wesley, 2005) pointed out the importance of the k = n − 1 case, where e...
متن کاملCMOS-MEMS Probes
... ... ... ... ... ... ... ... ... ... ... ... ... ... .... ... ... ... ... ... ... ......i Contents .... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ...iii Lists of Figures ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... .....ix Lists of Tables ...... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... ... .....xvii Ackno...
متن کامل